منابع مشابه
Impartial coloring games
Coloring games are combinatorial games where the players alternate painting uncolored vertices of a graph one of k > 0 colors. Each different ruleset specifies that game’s coloring constraints. This paper investigates six impartial rulesets (five new), derived from previously-studied graph coloring schemes, including proper map coloring, oriented coloring, 2-distance coloring, weak coloring, an...
متن کاملInfinite Cyclic Impartial Games
We define the family of locally path-bounded digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible, in a finite number of moves. This is done by proving that the Generalized Sprague-Grundy function exists uniquely and has finite values on this class.
متن کاملThree-player impartial games
Past efforts to classify impartial three-player combinatorial games (the theories of Li [3] and Straffin [4]) have made various restrictive assumptions about the rationality of one’s opponents and the formation and behavior of coalitions. One may instead adopt an agnostic attitude towards such issues, and seek only to understand in what circumstances one player has a winning strategy against th...
متن کاملMisère quotients for impartial games
We announce misère-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misère quotients—commutative monoids that encode the additive structure of specific misère-play games. We also introduce several advances in the structure theory of misère quotients, including a connection between the combinatorial structure of normal and misère play.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.02.032